KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases

In relational databases, it is essential to know all minimal keys since the concept of database normaliza-tion based on and functional dependencies a relation schema. Existing algorithms for determining keysor computing closure arbitrary sets attributes are generally time-consuming. this paper we present anefficient algorithm, called KeyFinder, solving key-finding problem. We also propose more direct methodfor set attributes. KeyFinder powerful proof procedure findingkeys tableaux. Experimental results show that outperforms its predecessors in terms searchspace execution time.